Cellular automata models of single-lane traffic
نویسندگان
چکیده
منابع مشابه
A multi-lane traffic simulation model via continuous cellular automata
Traffic models based on cellular automata have high computational efficiency because of their simplicity in describing unrealistic vehicular behavior and the versatility of cellular automata to be implemented on parallel processing. On the other hand, the other microscopic traffic models such as car-following models are computationally more expensive, but they have more realistic driver behavio...
متن کاملTwo-lane traffic rules for cellular automata: A systematic approach
Kai Nagel,* Dietrich E. Wolf, Peter Wagner, and Patrice Simon Los Alamos National Laboratory, TSA-DO/SA Mail Stop M997, Los Alamos, New Mexico 87545 Theoretische Physik, Gerhard-Mercator-Universität, 47048 Duisburg, Germany Zentrum für Paralleles Rechnen, Universität zu Köln, 50923 Köln, Germany Deutsches Zentrum für Luftund Raumfahrt, Linder Höhe, 51170 Köln, Germany ~Received 18 December 1997!
متن کاملSpontaneous-braking and lane-changing effect on traffic congestion using cellular automata model applied to the two-lane traffic
In the real traffic situations, vehicle would make a braking as the response to avoid collision with another vehicle or avoid some obstacle like potholes, snow, or pedestrian that crosses the road unexpectedly. However, in some cases the spontaneous-braking may occur even though there are no obstacles in front of the vehicle. In some country, the reckless driving behaviors such as sudden-stop b...
متن کاملAnalyzing of Two-Lane Traffic Flow Simulation Model using Cellular Automata
As traffic demand on road networks steadily increases every year, the need for alleviation of global congestion arises. Our contribution lies in assisting of traffic engineers and policy makers who are faced with the problem of controlling the traffic flows. In this paper, we explore the usefulness of cellular automata to traffic flow modeling. We extend some of the existing CA models to captur...
متن کاملExact results for deterministic cellular automata traffic models.
We present a rigorous derivation of the flow at arbitrary time in a deterministic cellular automaton model of traffic flow. The derivation employs regularities in preimages of blocks of zeros, reducing the problem of preimage enumeration to a well-known lattice path counting problem. Assuming infinite lattice size and random initial configuration, the flow can be expressed in terms of generaliz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 1997
ISSN: 1063-651X,1095-3787
DOI: 10.1103/physreve.56.4104